Bin-Packing Problem with Concave Costs of Bin Utilization
نویسندگان
چکیده
We consider a generalized one-dimensional bin-packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin-packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst-case performances when they are applied to our model. The absolute worst-case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 53: 298–308, 2006.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملAn asymptotic approximation scheme for the concave cost bin packing problem
We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecreasing concave function of the utilization of the bin. We show that for any given positive constant , there exists a polynomial-time approximation algorithmwith an asymptotic worst-case performance ratio of no more than 1 + .
متن کاملBin packing with general cost structures
Following the work of Anily et al., we consider a variant of bin packing, called BIN PACKING WITH GENERAL COST STRUCTURES (GCBP) and design an asymptotic fully polynomial time approximation scheme (AFPTAS) for this problem. In the classic bin packing problem, a set of one-dimensional items is to be assigned to subsets of total size at most 1, that is, to be packed into unit sized bins. However,...
متن کاملEfficient Heuristics for the Variable Size Bin Packing Problem with Fixed Costs
We consider the Variable Size Bin Packing Problem with Fixed Costs, a generalization of the well-known bin packing problem where a set of items must be packed within a set of heterogeneous bins characterized by possibly different volumes and fixed costs. The objective of the problem is to select the bins to pack all items while minimizing the total cost incurred for the selected bins. We presen...
متن کاملA Three-dimensional Bin Packing Algorithm
In this paper an approximation algorithm for the three-dimensional bin packing problem is proposed and its performance bound is investigated. To obtain such a bound a modified bin packing algorithm is considered for a two-dimensional problem with bounded bin and its area utilization is estimated. Finally, a hard example gives a lower bound of the performance bound. '
متن کامل